A Sparse Recovery Algorithm Based on Arithmetic Optimization

At present, the sparse recovery problem is mainly solved by convx optimization algorithm and greedy tracking method. However, former has defects in efficiency latter ability, neither of them can obtain effective under large sparsity or small observation degree. In this paper, we propose a new based on arithmetic combine ideas The proposed uses to solve coefficient signal transform domain, so as reconstruct original signal. same time, technique combined design initial position operator before solving, that it be searched better. Experiments show compared with other methods, not only more recovery, but also run faster general conditions number. It recover better presence noise.